Total Tetris : Tetris with Monominoes , Dominoes , Trominoes , Pentominoes , . .
نویسندگان
چکیده
We consider variations on the classic video game Tetris where pieces are k-ominoes instead of the usual tetrominoes (k = 4), as popularized by the video games ntris and Pentris. We prove that it is NP-complete to survive or clear a given initial board with a given sequence of pieces for each k ≥ 5, complementing the previous NP-completeness result for k = 4. More surprisingly, we show that board clearing is NP-complete for k = 3; and if pieces may not be rotated, then clearing is NP-complete for k = 2 and survival is NP-complete for k = 3. All of these problems can be solved in polynomial time for k = 1.
منابع مشابه
Effects of Video Game Playing on Measures of Spatial Performance: Gender Effects in Late Adolescence
Older adolescents played the video gome Tetris for a total of 6 hr each in two separate experiments. None of the subjects had had any prior experience with Tetris, o video game requiring the rapid rotation ond placement of seven different-shaped blocks. In Experiment 1, subjects were preand posttested on poper-and-pencil meosures of spatial obility. In Experiment 2, computerized meosures of men...
متن کاملApplying reinforcement learning to Tetris
This paper investigates the possible application of reinforcement learning to Tetris. The author investigates the background of Tetris, and qualifies it in a mathematical context. The author discusses reinforcement learning, and considers historically successful applications of it. Finally the author discusses considerations surrounding implementation.
متن کاملItération sur les Politiques Optimiste et Apprentissage du Jeu de Tetris. (Optimistic Policy Iteration and Learning the Game of Tetris)
متن کامل
Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete
We study the computational complexity of packing puzzles of identical polyominoes. Packing dominoes (i.e., 1 × 2 rectangles) into grid polygons can be solved in polynomial time by reducing to a bipartite matching problem. On the other hand, packing 2 × 2 squares is known to be NP-complete. In this paper, we fill the gap between dominoes and 2 × 2 squares, that is, we consider the packing puzzle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017